Shape Matching and Clustering

نویسندگان

  • Sungwoo Lim
  • Alex H B Duffy
  • Byungsuk Lee
چکیده

Generalising knowledge and matching patterns is a basic human trait in re-using past experiences. We often cluster (group) knowledge of similar attributes as a process of learning and or aid to manage the complexity and re-use of experiential knowledge [1, 2]. In conceptual design, an ill-defined shape may be recognised as more than one type. Resulting in shapes possibly being classified differently when different criteria are applied. This paper outlines the work being carried out to develop a new technique for shape clustering. It highlights the current methods for analysing shapes found in computer aided sketching systems, before a method is proposed that addresses shape clustering and pattern matching. Clustering for vague geometric models and multiple viewpoint support are explored.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

A Comparative Study of Some Clustering Algorithms on Shape Data

Recently, some statistical studies have been done using the shape data. One of these studies is clustering shape data, which is the main topic of this paper. We are going to study some clustering algorithms on shape data and then introduce the best algorithm based on accuracy, speed, and scalability criteria. In addition, we propose a method for representing the shape data that facilitates and ...

متن کامل

Shape Recognition by Clustering and Matching of Skeletons

We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric features of the shape are captured using Radius function along the skeletal curve segments. Matching of the connectivity graphs based on their topologies and geometric features gives a distance measure for determining si...

متن کامل

Dynamic Clustering-based Method for Shape Recognition and Retrieval

This paper presents a shape matching framework based on a new shape decomposition approach. A new region-based shape descriptor is proposed to compute the best match between given 2D or 3D shapes. In order to find similar shapes in a database, we first split the interior of each shape into the adequate set of parts, classes, or ellipsoids, then find the corresponding parts between different sha...

متن کامل

Clustering Unstructured Text Documents Using Naïve Bayesian Concept and Shape Pattern Matching

Clustering organizes text in an unsupervised fashion. In this paper, we propose an algorithm for clustering unstructured text documents using naïve Bayesian concept and shape-pattern matching. The Vector Space Model is used to represent our dataset as a term-weight matrix. In any natural language, semantically linked terms tend to co-occur in documents. Hence, the co-occurrences of pairs of ter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001